Algorithms for Symbolic Polynomials
نویسنده
چکیده
•Computer algebra systems have a hard time working with symbolic values, e.g. –Polynomials of degree d –Elements of a field of characterisic p –Matrices of dimension n × n when d, p and n are not given. •We are interested in expanding the range of problems computer algebra systems can handle, beginning with algorithms for polynomials of symbolic degree. •+, ×, ∂ are straightforward. •What about other fundamental operations such as GCD, factorization etc?
منابع مشابه
Two Families of Algorithms for Symbolic Polynomials
We consider multivariate polynomials with exponents that are themselves integer-valued multivariate polynomials, and we present algorithms to compute their GCD and factorization. The algorithms fall into two families: algebraic extension methods and projection methods. The first family of algorithms uses the algebraic independence of x, x, x 2 , x, etc, to solve related problems with more indet...
متن کاملSymbolic Polynomials with Sparse Exponents
Earlier work has presented algorithms to factor and compute GCDs of symbolic Laurent polynomials, that is multivariate polynomials whose exponents are integer-valued polynomials. These earlier algorithms had the problem of high computational complexity in the number of exponent variables and their degree. The present paper solves this problem, presenting a method that preserves the structure of...
متن کاملA Symbolic-Numeric Software Package for the Computation of the GCD of Several Polynomials
This survey is intended to present a package of algorithms for the computation of exact or approximate GCDs of sets of several polynomials and the evaluation of the quality of the produced solutions. These algorithms are designed to operate in symbolic-numeric computational environments. The key of their effectiveness is the appropriate selection of the right type of operations (symbolic or num...
متن کاملAlgorithms for the Functional Decomposition of Laurent Polynomials
Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univariate Laurent polynomial decompositions efficiently and gives their multivariate generalization. One application of functional decomposition of Laurent polynomials is the functional decomposition of so-called “symbolic polynomials...
متن کاملMaking Computer Algebra More Symbolic
This paper is a step to bring closer together two views of computing with mathematical objects: the view of “symbolic computation” and the view of “computer algebra.” Symbolic computation may be seen as working with expression trees representing mathematical formulae and applying various rules to transform them. Computer algebra may be seen as developing constructive algorithms to compute algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006